Stable Equivalence and the Stable Triangle Category
نویسندگان
چکیده
منابع مشابه
Derived Equivalence and Stable Equivalence of Repetitions
For repetitions (= repetitive \algebras") of algebras of nite global dimension we will show that there exists a triangle equivalence between their bounded derived categories of nitely presented modules ii there exists a triangle equivalence between their stable categories of nitely presented modules.
متن کاملStable equivalence preserves representation type
Given two finite dimensional algebras Λ and Γ, it is shown that Λ is of wild representation type if and only if Γ is of wild representation type provided that the stable categories of finite dimensional modules over Λ and Γ are equivalent. The proof uses generic modules. In fact, a stable equivalence induces a bijection between the isomorphism classes of generic modules over Λ and Γ, and the re...
متن کاملStable Equivalence over Symmetric Functions
Abstract. By using cutting strips and transformations on outside decompositions of a skew diagram, we show that the Giambelli-type matrices for a given skew Schur function are stably equivalent to each other over symmetric functions. As a consequence, the Jacobi-Trudi matrix and the transpose of the dual Jacobi-Trudi matrix are stably equivalent over symmetric functions. This leads to an affirm...
متن کاملStable Equivalence of Differentiable Manifolds
A natural question, of great generality, various special forms of which are often asked in differential topology, is the following: Let Mi, Mi be differentiable w-manifolds, : M\—»M2 a continuous map which is a homotopy equivalence between M\ and M2. When is there a differentiable isomorphism <3>: Mi—> M2 in the same homotopy class as 0? For example, there is the Poincaré Conjecture which po...
متن کاملEquivalence for the G3'-stable models semantics
We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how some particular cases of testing strong equivalence between programs can be reduced to verify if a formula is a theorem in some paraconsistent logics or in some cases in classical logic. We also present some program transformat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1993
ISSN: 0021-8693
DOI: 10.1006/jabr.1993.1093